Arbitrary Selection for Agitate Flexible Load Balancing in Heterogeneous Peer to Peer Networks
نویسنده
چکیده
Peer to Peer Network access is the integral part of the day to day business for most of the computer users. Preserving load balance on heterogeneous peer to peer networks is a challenging purpose and several existing works presented load redistribution algorithms for load division and load diversions at the instance the new peer enters. The aim of load balancing in P2P networks is to equilibrium the workload of the network nodes in quantity but lacks to eliminate traffic occurring in the routes of the P2P network efficiently. In this paper, the behaviors are characterized by eliminating the traffic using the Arbitrary Selection Load Balancing (ASLB) Approach with Tremendous Store model. Tremendous store model is investigated to extend the impact of node heterogeneity and agitate to the load distribution in P2P networks. The performance of the Arbitrary Selection Load Balancing (ASLB) Approach with Tremendous Store model reduces the network traffic routes with minimal cost of P2P in contrast to existing Saturn load balancing scheme. An analytical and empirical result offers a collision free system with the quantization of information by balancing the load in the P2P network system. Performance of the Arbitrary Selection Load Balancing is measured in terms of peer failure probability and traffic control efficiency.
منابع مشابه
Time Variant-Peer Node Heterogeneous Peer to Peer Networks using Dynamic Warping Algorithm
In the current internet scenario more virtual servers and mirror servers are utilized to maintain load balance of the heterogeneous peer to peer networks. One of the most current existing works developed a state balancing system based on probability distribution of peer abilities, loads of virtual servers, and incomplete data of global peers. On the other hand state balancing method recognizing...
متن کاملA parameter-free load balancing mechanism for P2P networks
Random peer selection is commonly used to provide load-balancing in decentralized P2P systems. This paper addresses two practical concerns with using random peer selection for load balancing. The first has to do with heterogeneous peer selection mechanisms that accommodate differences in capacities of different peers. These heterogeneous selection mechanisms are not parameter-free: Each peer as...
متن کاملRandomized load balancing strategies with churn resilience in peer-to-peer networks
The objective of load balancing in peer-to-peer (P2P) networks is to balance the workload of peer nodes in proportion to their capacity so as to eliminate performance bottlenecks. It is challenging because of the dynamic nature in overlay networks, the time-varying load characteristics, and the inherent load imbalance caused by consistent hashing functions. It is known that simple randomized lo...
متن کاملStructured Peer-to-Peer Systems using Load Balancing with Imperfect Information
with the notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities. The existing and decentralized load balance algorithms designed for the heterogeneous, structured P2P networks either explicitly construct...
متن کاملLoad Balancing in Peer-to-Peer Systems
Structured peer-to-peer (P2P) overlay networks like Distributed Hash Tables (DHTs) map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Thus, a load balancing mechanism is an indispensable part of a structured P2P overlay network for high performance. The rapid development of P2P systems has posed challeng...
متن کامل